Repairing Efficient Threshold Group Signature Scheme
نویسنده
چکیده
To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the proposed scheme can use short secret key and reduces the load of signature verification. However, in this paper we find that there are many ambiguities in the proposed scheme. The verifiers cannot verify valid signatures, while adversaries can not only easily forge the signatures of individual members, but also forge group signatures without the knowledge of secret keys. Though we can modify it to withstand this forgery attack, the modified scheme cannot withstand a general coalition attack inherent in many threshold signature schemes.
منابع مشابه
An Efficient Threshold Signature Scheme Resistible to Conspiracy Attack
The study presents a threshold signature scheme. While developing threshold cryptography, the concept of threshold signature can accomplish a tradeoff between efficiency in use and dependability of security. The presented threshold signature scheme can resist conspiracy attack by controlling the right of issuing group signature, and the performance of constructing group signature is also enhanc...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملEfficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme
We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap Diffie-Hellman (GDH) group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy). Our constructions are based on the recently proposed GDH signature scheme of Boneh et al. [BLS]. Due to the instrumental structur...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملOn the Security of the Li-Hwang-Lee-Tsai Threshold Group Signature Scheme
A (t, n) threshold group signature scheme is a generalization of group signature, in which only t or more members from a given group with n members can represent the group to generate signatures anonymously and the identities of signers of a signature can be revealed in case of dispute later In this paper, we first present a definition of threshold group signatures, and propose several requirem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 7 شماره
صفحات -
تاریخ انتشار 2008